Analysis of RSA algorithm using GPU programming

摘要

Modern-day computer security relies heavily on cryptography as a means toprotect the data that we have become increasingly reliant on. The main researchin computer security domain is how to enhance the speed of RSA algorithm. Thecomputing capability of Graphic Processing Unit as a co-processor of the CPUcan leverage massive-parallelism. This paper presents a novel algorithm forcalculating modulo value that can process large power of numbers whichotherwise are not supported by built-in data types. First the traditionalalgorithm is studied. Secondly, the parallelized RSA algorithm is designedusing CUDA framework. Thirdly, the designed algorithm is realized for smallprime numbers and large prime number . As a result the main fundamental problemof RSA algorithm such as speed and use of poor or small prime numbers that hasled to significant security holes, despite the RSA algorithm's mathematicalsoundness can be alleviated by this algorithm.